Hamiltonian cycles in regular graphs of moderate degree
نویسندگان
چکیده
منابع مشابه
Hamiltonian cycles in regular graphs of moderate degree
In this paper we prove that if k is an integer no less than 3, and if G is a two-connected graph with 2n a vertices, a E {0, 1}, which is regular of degree n k, then G is Hamiltonian if a = 0 and n > k2 + k + 1 or if a = I and n > 2k 2 3k =, 3 . We use the notation and terminology of [1] . Gordon [4] has proved that there are only a small number of exceptional graphs with 2n vertices which are ...
متن کاملCycles in hamiltonian graphs of prescribed maximum degree
Let G be a hamiltonian graph G of order n and maximum degree , and let C(G) denote the set of cycle lengths occurring in G. It is easy to see that |C(G)|¿ − 1. In this paper, we prove that if ¿n=2, then |C(G)|¿ (n + − 3)=2. We also show that for every ¿ 2 there is a graph G of order n¿ 2 such that |C(G)|= − 1, and the lower bound in case ¿n=2 is best possible. c © 2003 Elsevier Science B.V. All...
متن کاملEdge-disjoint Hamilton Cycles in Regular Graphs of Large Degree
Theorem 1 implies that if G is a A:-regular graph on n vertices and n ^ 2k, then G contains Wr(n + 3an + 2)] edge-disjoint Hamilton cycles. Thus we are able to increase the bound on the number of edge-disjoint Hamilton cycles by adding a regularity condition. In [5] Nash-Williams conjectured that if G satisfies the conditions of Theorem 2, then G contains [i(n + l)] edge-disjoint Hamilton cycle...
متن کاملHamiltonian Cycles in Regular Tournaments
We show that every regular tournament on n vertices has at least n!/(2+o(1)) Hamiltonian cycles, thus answering a question of Thomassen [17] and providing a partial answer to a question of Friedgut and Kahn [7]. This compares to an upper bound of about O(nn!/2) for arbitrary tournaments due to Friedgut and Kahn (somewhat improving Alon’s bound of O(nn!/2)). A key ingredient of the proof is a ma...
متن کاملUniform Generation of Random Regular Graphs of Moderate Degree
We show how to generate k-regular graphs on n vertices uniformly at random in expected time O(nk3), provided k = O(n1/3). The algorithm employs a modification of a switching argument previously used to count such graphs asymptotically for k = o(n1/3). The asymptotic formula is re-derived, using the new switching argument. The method is applied also to graphs with given degree sequences, provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1977
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90063-6